Intersection theorems for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e21" altimg="si4.svg"><mml:mrow><mml:mo>(</mml:mo><mml:mo linebreak="goodbreak" linebreakstyle="after">−</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-vectors
نویسندگان
چکیده
In this paper, we investigate Erdős–Ko–Rado type theorems for families of vectors from {0,±1}n with fixed numbers +1’s and −1’s. Scalar product plays the role intersection size. particular, sharpen our earlier result on largest size a family such that avoids smallest possible scalar product. We also obtain an exact no negative products.
منابع مشابه
Intersection Theorems for Vector Spaces
[ n] qni_ 1 = IT / i . t q O""i<, q -1 Since we always refer to the same K, we will write this simply as [7]. If A, Bare subspaces of V, A < B, then B/ A denotes the factor space of B by A. If An B = (O)-the zero-space, then AB / A is the canonical projection of B into V / A. Suppose 1 ~ k < nand !¥ = {Fl> .. . , Fm} is a family of distinct k-dimensional subspaces of V. For 0 ~ s ~ k, let !¥(s)...
متن کاملIntersection homology Künneth theorems
Cohen, Goresky and Ji showed that there is a Künneth theorem relating the intersection homology groups I H∗(X × Y ) to I H∗(X) and I H∗(Y ), provided that the perversity p̄ satisfies rather strict conditions. We consider biperversities and prove that there is a Künneth theorem relating I H∗(X × Y ) to I H∗(X) and I H∗(Y ) for all choices of p̄ and q̄. Furthermore, we prove that the Künneth theorem...
متن کاملMore complete intersection theorems
The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of a k-uniform t-intersecting family on n points, and describes all optimal families. In recent work, we extended this theorem to the weighted setting, giving the maximum μp measure of a t-intersecting family on n points. In this work, we prove two new complete intersection theorems. The first gi...
متن کاملIntersection Theorems for Systems of Sets (iii)
A system or family (A. : y E N) of sets A y , indexed by the elements of a set N, is called an (a, b)-system if I N I = a and I A,, I = b for y c-N. Expressions such as "(a, < b)-system" are self-explanatory. The system (A,, : y c N) is called a A-system [1] if A,, n A,, = Ap n A Q whenever p, y, p, c c N ; p 7~ y ; p =A a. If we want to indicate the cardinality I NJ of the index set N then we ...
متن کاملIntersection Theorems for Systems of Sets ( Ii )
In this paper we present the complete solution of the problem which was considered in [1], with the exception of the case in which both the given cardinal numbers are finite. The results of [1] will not be assumed. We begin by introducing some definitions, f A system Li = (Bv: veiV) of sets Bv, where v ranges over the index set N, is said to contain the system Eo = (A^ : n e M) if, for (j.o e M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2023
ISSN: ['1095-9971', '0195-6698']
DOI: https://doi.org/10.1016/j.ejc.2023.103830